The Metric-FF Planning System: Translating "Ignoring Delete Lists" to Numeric State Variables

نویسنده

  • Jörg Hoffmann
چکیده

Planning with numeric state variables has been a challenge for many years, and was a part of the 3rd International Planning Competition (IPC-3). Currently one of the most popular and successful algorithmic techniques in STRIPS planning is to guide search by a heuristic function, where the heuristic is based on relaxing the planning task by ignoring the delete lists of the available actions. We present a natural extension of “ignoring delete lists” to numeric state variables, preserving the relevant theoretical properties of the STRIPS relaxation under the condition that the numeric task at hand is “monotonic”. We then identify a subset of the numeric IPC-3 competition language, “linear tasks”, where monotonicity can be achieved by preprocessing. Based on that, we extend the algorithms used in the heuristic planning system FF to linear tasks. The resulting system Metric-FF is, according to the IPC-3 results which we discuss, one of the two currently most efficient numeric planners.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Translating “Ignoring Delete Lists” to Numeric State Variables The Metric-FF Planning System: Translating “Ignoring Delete Lists” to Numeric State Variables

Planning with numeric state variables has been a challenge for many years, and was a part of the 3rd International Planning Competition (IPC-3). One of the currently most popular and successful algorithmic techniques in STRIPS planning is to guide search by a heuristic function, where the heuristic is based on relaxing the planning task by ignoring the delete lists of the available actions. We ...

متن کامل

FF: The Fast-Forward Planning System

planner in the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS’00) planning systems competition. Like the well-known HSP system, FF relies on forward search in the state space, guided by a heuristic that estimates goal distances by ignoring delete lists. It differs from HSP in a number of important details. This article describes the algorithmic technique...

متن کامل

Extending FF to Numerical State Variables

The FF system obtains a heuristic estimate for each state during a forward search by solving a relaxed version of the planning task, where the relaxation is to assume that all delete lists are empty. We show how this relaxation, and FF’s heuristic function, can naturally be extended to planning tasks with constraints and effects on numerical state variables. First results show that the implemen...

متن کامل

A Planning Heuristic Based on Causal Graph Analysis

In recent years, heuristic search methods for classical planning have achieved remarkable results. Their most successful representative, the FF algorithm, performs well over a wide spectrum of planning domains and still sets the state of the art for STRIPS planning. However, there are some planning domains in which algorithms like FF and HSP perform poorly because their relaxation method of ign...

متن کامل

The FF Planning System : Fast Plan Generation

We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts to be independent. We introduce a novel search strategy that combines hill-climbing with systematic search, and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Artif. Intell. Res.

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2003